Validating Word-oriented Processors for Bit-level Permutations and Multi-word Operations in Pervasive Secure Computing Paradigms
ثبت نشده
چکیده
Pervasive secure computing paradigms in the publicly interconnected world pose new challenges in the architecture of future general-purpose processors. These paradigms include safer communications, storage and execution. Basic security functions like confidentiality, data integrity and user authentication can be achieved by symmetric-key, hash and public-key cryptography algorithms, respectively. In analyzing these classes of algorithms, we identify two categories of operations not common in previous general-purpose workloads: bit operations within a word and multi-word operations. We describe where both types of operations are needed. Both challenge the basic word orientation of processors. We address both challenges in this paper. First, we show how difficult bit-level operations, namely arbitrary bit permutations within a word, can be achieved in just 1 or 2 cycles. This improves upon the O(n) instructions needed to achieve any one of n! permutations of n bits in existing RISC processors; it also improves upon recent work that achieves this in O(log(n)) instructions. This paper contributes two new architectural solutions, one with only micro-architecture changes, and another with ISA support as well. Slightly enhanced 4-way and 2-way superscalar microprocessors can achieve arbitrary 64-bit permutations in 1 or 2 cycles. The second challenge can be described as instructions that need more than two word-sized operands and/or produce more than one word-sized result. This is true in public-key algorithms where the key size and operands require multiple n-bit words per operand. It is also true in symmetric-key algorithms where, for example, the number of control bits needed to specify one of n! permutations exceeds the word-size of n bits. This paper shows how the second challenge can also be met by a generalization of our solutions to the first challenge. This validates current word-oriented processors while still achieving superior bitlevel and multi-word operations needed by emerging secure computing paradigms.
منابع مشابه
Validating Word-Oriented Processors for Bit and Multi-word Operations
We examine secure computing paradigms to identify any new architectural challenges for future general-purpose processors. Some essential security functions can be provided by different classes of cryptography algorithms. We identify two categories of operations in these algorithms that are not common in previous general-purpose workloads: bit operations within a word and multi-word operations. ...
متن کاملPerforming Permutations in Software Can Facilitate More Widespread Use of Secure Information Processing and Faster
Pervasive secure information processing over the public wired and wireless Internet could benefit from rapid and convenient cryptographic transformations. But the performance of software-implemented cryptographic functions is hampered by certain operations that have not been optimized in a processor’s instruction set architecture because they occurred infrequently in earlier programming workloa...
متن کاملChapter I Permutation Operations in Block Ciphers
New and emerging applications can change the mix of operations commonly used within computer architectures. It is sometimes surprising when instruction-set architecture (ISA) innovations intended for one purpose are used for other (initially unintended) purposes. This chapter considers recent proposals for the processor support of families of bit-level permutations. From a processor architectur...
متن کاملArchitectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permutations with repetitions are rearrangements of an ordered set in which elements may replace other elements in the set; such permutations are useful in cryptographic algorithms. On a 4-way superscalar processor, an arbit...
متن کاملFPGA Implementations of a Parallel Associative Processor with Multi-Comparand Multi-Search Operations
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, graph theory and list/matrix computations. In this paper we report new FPGA implementations of a multi– comparand multi–search associative processor. The architecture of the processor working in a combined bit– serial/bit...
متن کامل